NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
521	Distributed Computing FS 2012 Prof. R. Wattenhofer Stephan Holzer Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 NP-complete problems Dominating set Chernoff bound Tango tree Theoretical computer science Mathematics Computational complexity theory
522	Unifying Execution of Imperative and Declarative Code Aleksandar Milicevic Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2012-02-20 11:43:30 Sudoku NP-complete problems Sudoku algorithms Mathematics of Sudoku Mathematics Recreational mathematics Logic puzzles
523	0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 Add to Reading List Source URL: mrfellows.net Language: English - Date: 2009-09-08 08:50:37 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Feedback vertex set Vertex cover Tree decomposition Theoretical computer science Graph theory Computational complexity theory
524	CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗ Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Network theory Shortest path problem Geodesic Travelling salesman problem Motion planning Trigonometric functions NP Curvature Theoretical computer science Mathematics Computational complexity theory
525	Comparison of Two CDS Algorithms on Random Unit Ball Graphs Jennie C. Hansen∗ Abstract This paper compares asymptotic “average case”performance of two closely related algorithms for finding small connected dominati Add to Reading List Source URL: www.siam.org Language: English - Date: 2005-07-06 08:19:04 Applied mathematics NP-complete problems Dominating set Random graph Connectivity Graph Theoretical computer science Mathematics Graph theory
526	Parallelization of Genetic Operations that Takes Building-Block Linkage into Account Yuji Sato, Hazuki Inoue, Mikiko Sato+ Graduate School of Computer and Information Sciences, Hosei University, 3-7-2 Kajino-cho, Koga Add to Reading List Source URL: www.genetic-programming.org Language: English* - Date: 2013-06-23 23:45:34 Recreational mathematics Theoretical computer science NP-complete problems Sudoku Genetic algorithm Backtracking Crossover Parallel computing Sudoku algorithms Mathematics Logic puzzles Search algorithms
527	ICS 161 — Algorithms — Spring 2005 — Second Midterm Please answer the following seven questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to wri Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2005-05-26 20:09:03 Operations research Graph theory Mathematical optimization NP-complete problems Network theory Algorithm Shortest path problem Dynamic programming Graph Theoretical computer science Mathematics Applied mathematics
528	On Rolling Cube Puzzles Kevin Buchin∗ Martin L. Demaine† Christian Knauer∗ Maike Buchin∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:28:52 NP-complete problems Hamiltonian path Icosahedron Combination puzzles Puzzles Line graph N-dimensional sequential move puzzle Graph theory Theoretical computer science Mathematics
529	CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Mathematics Dominating set Unit disk graph Independent set APX Approximation algorithm Vertex cover Planar separator theorem Theoretical computer science Graph theory NP-complete problems

UPDATE